Regularity and the Gorenstein property of $L$-convex Polyominoes

نویسندگان

چکیده

We study the coordinate ring of an $L$-convex polyomino, determine its regularity in terms maximal number rooks that can be placed polyomino. also characterize Gorenstein polyominoes and those which are on punctured spectrum, compute Cohen–Macaulay type any polyomino rectangles covering it. Though main results algebraic nature, all proofs combinatorial.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tomographical aspects of L-convex polyominoes

Our main purpose is to characterize the class of L-convex polyominoes introduced in [3] by means of their horizontal and vertical projections. The achieved results allow an answer to one of the most relevant questions in tomography i.e. the uniqueness of discrete sets, with respect to their horizontal and vertical projections. In this paper, by giving a characterization of L-convex polyominoes,...

متن کامل

Combinatorial aspects of L-convex polyominoes

We consider the class of L-convex polyominoes, i.e. those polyominoes in which any two cells can be connected with an “L” shaped path in one of its four cyclic orientations. The paper proves bijectively that the number fn of L-convex polyominoes with perimeter 2(n + 2) satisfies the linear recurrence relation fn+2 = 4 fn+1 − 2 fn , by first establishing a recurrence of the same form for the car...

متن کامل

An object grammar for the class of L-convex polyominoes

We consider the class of L-convex polyominoes, i.e. convex polyominoes where any two chosen cells can be connected simply using an internal path having at most one change of direction. The main result of the paper is the definition of an object grammar decomposition of this class, which gives combinatorial evidence of the rationality of the generating function, and suggests some new combinatori...

متن کامل

Reconstruction of 2-convex polyominoes

There are many notions of discrete convexity of polyominoes (namely hvconvex [1], Q-convex [2], L-convex polyominoes [5]) and each one has been deeply studied. One natural notion of convexity on the discrete plane leads to the definition of the class of hv-convex polyominoes, that is polyominoes with consecutive cells in rows and columns. In [1] and [6], it has been shown how to reconstruct in ...

متن کامل

Counting k-Convex Polyominoes

We compute an asymptotic estimate of a lower bound of the number of k-convex polyominoes of semiperimeter p. This approximation can be written as μ(k)p4p where μ(k) is a rational fraction of k which up to μ(k) is the asymptotics of convex polyominoes. A polyomino is a connected set of unit square cells drawn in the plane Z × Z [7]. The size of a polyomino is the number of its cells. A central p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Combinatorics

سال: 2021

ISSN: ['1077-8926', '1097-1440']

DOI: https://doi.org/10.37236/9531